Permissive strategies: from parity games to safety games
نویسندگان
چکیده
منابع مشابه
Permissive strategies: from parity games to safety games
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive stra...
متن کاملPermissive multi-strategies in timed games
This report deals with non-deterministic timed strategies, also called timed multi-strategies, for two-player games played between a controller and the environment on the structure of a timed automaton. The motivation of the concept of multi-strategies in timed systems is to have a certain flexibility of which action to be executed. We introduce a penalty for the controller as a quantitative me...
متن کاملPermissive strategies in timed automata and games
Timed automata are a convenient framework for modelling and reasoning about real-time systems. While these models are now well-understood, they do not offer a convenient way of taking timing imprecisions into account. Several solutions (e.g. parametric guard enlargement) have been proposed over the last ten years to take such imprecisions into account. In this paper, we propose a novel approach...
متن کاملA reduction from parity games to simple stochastic games
Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model various open systems in computer science, as for instance turnbased or concurrent moves, and deterministic or stochastic transitions. In this paper, we are inte...
متن کاملA reduction from parity games to simple stochastic games
Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model various open systems in computer science, as for instance turnbased or concurrent moves, and deterministic or stochastic transitions. In this paper, we are inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2002
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita:2002013